class MyCircularQueue {
    public int[] elem;
    public int front;
    public int rear;
}

public MyCircularQueue(int k) {
        elem = new int[k];
        }

//入队操作
public boolean enQueue(int value) {
        if(isFull()) {
        return false;
        }
        elem[rear] = value;
        rear = (rear+1) % elem.length;
        return true;
        }
//删除队头元素
public boolean deQueue() {

        }
//得到队头元素 不删除
public int Front() {

        }

//得到队尾元素 不删除
public int Rear() {

        }

//判空 front和rear相遇
public boolean isEmpty() {

        }

public boolean isFull() {
        return (rear+1) % elem.length == front;
        }